Cutting plane algorithms and state space constrained linear optimal control problems
نویسندگان
چکیده
منابع مشابه
Approximate algorithms for constrained circular cutting problems
In this paper, we study the problem of cutting a rectangular plate R of dimensions (L;W ) into as many circular pieces as possible. The circular pieces are of n di4erent types with radii ri; i = 1; : : : ; n. We solve the constrained circular problem, where di the maximum demand for piece type i is speci+ed, using two heuristics: a constructive procedure-based heuristic and a genetic algorithm-...
متن کاملA virtual control concept for state constrained optimal control problems
where Ω ⊂ RN , N = 2, 3 is a bounded domain with C0,1-boundary, ν > 0 is a fixed number, yd and yc are given functions from L2(Ω). Furthermore, ua and ub are given real numbers with ua < ub. The difficulty of low regularity of solutions of problems with pointwise state constraints is pointed out in (1). Therefore, different regularization concepts are developed, see e.g. (2), (3), (4) and (5). ...
متن کاملCutting Plane Algorithms for Integer Programming, Cutting Plane Algorithms
Cutting plane methods are exact algorithms for integer programming problems. They have proven to be very useful computationally in the last few years, especially when combined with a branch and bound algorithm in a branch and cut framework. These methods work by solving a sequence of linear programming relax-ations of the integer programming problem. The relaxations are gradually improved to gi...
متن کاملState-constrained Optimal Control Problems of Impulsive Differential Equations
The present paper studies an optimal control problem governed by measure driven differential systems and in presence of state constraints. The first result shows that using the graph completion of the measure, the optimal solutions can be obtained by solving a reparametrized control problem of absolutely continuous trajectories but with time-dependent state-constraints. The second result shows ...
متن کاملPreconditioned Solution of State Gradient Constrained Elliptic Optimal Control Problems
Elliptic optimal control problems with pointwise state gradient constraints are considered. A quadratic penalty approach is employed together with a semismooth Newton iteration. Three different preconditioners are proposed and the ensuing spectral properties of the preconditioned linear Newton saddle-point systems are analyzed in dependence on the penalty parameter. A new bound for the smallest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1970
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(70)80030-7